Regular Steinhaus graphs of odd degree

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regular Steinhaus graphs of odd degree

A Steinhaus matrix is a binary square matrix of size n which is symmetric, with diagonal of zeros, and whose upper-triangular coefficients satisfy ai,j = ai−1,j−1+ai−1,j for all 2 6 i < j 6 n. Steinhaus matrices are determined by their first row. A Steinhaus graph is a simple graph whose adjacency matrix is a Steinhaus matrix. We give a short new proof of a theorem, due to Dymacek, which states...

متن کامل

Regular Graphs of Odd Degree Are Antimagic

An antimagic labeling of a graph G with m edges is a bijection from E(G) to {1, 2, . . . ,m} such that for all vertices u and v, the sum of labels on edges incident to u differs from that for edges incident to v. Hartsfield and Ringel conjectured that every connected graph other than the single edge K2 has an antimagic labeling. We prove this conjecture for regular graphs of odd degree.

متن کامل

Parity-regular Steinhaus graphs

Steinhaus graphs on n vertices are certain simple graphs in bijective correspondence with binary {0,1}-sequences of length n−1. A conjecture of Dymacek in 1979 states that the only nontrivial regular Steinhaus graphs are those corresponding to the periodic binary sequences 110...110 of any length n − 1 = 3m. By an exhaustive search the conjecture was known to hold up to 25 vertices. We report h...

متن کامل

The Chinese Postman Problem in Regular Graphs of Odd Degree

The Chinese Postman Problem in a graph is the problem of finding a shortest closed walk traversing all the edges. In a (2r + 1)-regular graph, the problem is equivalent to finding a smallest spanning subgraph in which all vertices have odd degree. We establish a sharp upper bound for the solution in 3-regular graphs, characterize when equality holds, and conjecture the answer for general r.

متن کامل

Taut Distance-Regular Graphs of Odd Diameter

Let denote a bipartite distance-regular graph with diameter D ≥ 4, valency k ≥ 3, and distinct eigenvalues θ0 > θ1 > · · · > θD . Let M denote the Bose-Mesner algebra of . For 0 ≤ i ≤ D, let Ei denote the primitive idempotent of M associated with θi . We refer to E0 and ED as the trivial idempotents of M . Let E, F denote primitive idempotents of M . We say the pair E, F is taut whenever (i) E,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2009

ISSN: 0012-365X

DOI: 10.1016/j.disc.2009.02.016